The measurement of ranks and the laws of iterated contraction
نویسندگان
چکیده
Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper shows how to reconstruct a ranking function from its iterated contraction behavior uniquely up to multiplicative constant and thus how to measure ranks on a ratio scale. Thereby, it also shows how to completely axiomatize that behavior. The complete set of laws of iterated contraction it specifies amend the laws hitherto discussed in the literature.
منابع مشابه
Measuring Ranks via the Complete Laws of Iterated Contraction
Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper gives a complete axiomatization of that behavior, i.e., a complete set of laws of iterated contraction. It does so by showing how to reconstruct a ranking function from its iterated contraction behavior uniquely up to multiplicative constant and thus how ...
متن کاملWeak $F$-contractions and some fixed point results
In this paper we define weak $F$-contractions on a metric space into itself by extending $F$-contractions introduced by D. Wardowski (2012) and provide some fixed point results in complete metric spaces and in partially ordered complete generalized metric spaces. Some relationships between weak $F$-contractions and $Fi$-contractions are highlighted. We also give some application...
متن کاملChaotic property for non-autonomous iterated function system
In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...
متن کاملController Placement in Software Defined Network using Iterated Local Search
Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...
متن کاملRotation number and its properties for iterated function and non-autonomous systems
The main purpose of this paper is to introduce the rotation number for non-autonomous and iterated function systems. First, we define iterated function systems and the lift of these types of systems on the unit circle. In the following, we define the rotation number and investigate the conditions of existence and uniqueness of this number for our systems. Then, the notions rotational entropy an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 172 شماره
صفحات -
تاریخ انتشار 2008